TERMIUM Plus®

The Government of Canada’s terminology and linguistic data bank.

breadth-first search algorithm [1 record]

Record 1 2019-10-30

English

Subject field(s)
  • Computer Mathematics
  • Computer Programs and Programming
DEF

A graph traversal algorithm that explores nodes in the order of their distance from the roots, where distance is defined as the minimum path length from a root to the node.

OBS

It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key'), and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.

French

Domaine(s)
  • Mathématiques informatiques
  • Programmes et programmation (Informatique)
CONT

L'algorithme de parcours en largeur permet de calculer les distances de tous les nœuds depuis un nœud source dans un graphe non pondéré (orienté ou non orienté). Il peut aussi servir à déterminer si un graphe non orienté est connexe.

Spanish

Campo(s) temático(s)
  • Matemáticas para computación
  • Programas y programación (Informática)
Save record 1

Copyright notice for the TERMIUM Plus® data bank

© Public Services and Procurement Canada, 2024
TERMIUM Plus®, the Government of Canada's terminology and linguistic data bank
A product of the Translation Bureau

Features

Language Portal of Canada

Access a collection of Canadian resources on all aspects of English and French, including quizzes.

Writing tools

The Language Portal’s writing tools have a new look! Easy to consult, they give you access to a wealth of information that will help you write better in English and French.

Glossaries and vocabularies

Access Translation Bureau glossaries and vocabularies.

Date Modified: